A Unified Analysis to the Queue Length Distributions in MX(k)/G/1/N and GI/MY(k)/1/N Queues
نویسندگان
چکیده
, Abstract We study an eMcient iterative algorithm fbr computing the stationary distributions ih MX/G/IZN queues with arbitrary state-dependent arrivals, that is, ., MX(k)/C/1/N queues. MX(k)/G/1/N queues include the well studied specidl cases, such as PBAS (partially batch acceptance strategy) At(,X/G/1/N queues and tt WBAS (whole batch acceptance strategy) MX/C/1/N queues. We only require the LaplaceStielojestransformoftheservicetimedistribrftfon.' ' ' ' Furthermore, we can obtain the algorithm for c6mputing the stationary queue '' length distributionS in GI/MY/1/N queues with state-dependent'services, or GI/MY(k)/1/N queues by using a relationship between the stationary queue length distributions in GJIM.Y(k)/1/N and MX(k)/G/1/N +l queues. ,J,
منابع مشابه
Bernoulli Vacation Policy for a Bulk Retrial Queue with Fuzzy Parameters
In this paper, we investigate the fuzzy logic based system characteristics of MX/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have...
متن کاملError Bounds for Perturbing Nonexponential Queues
A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in singleand multi-server queues. The general framework is worked out in detail for the three types of finite or infinite buffer queues: GI/G/1/N , M/G/c/N , and GI/M/c/N . First, for the standard GI/G/1/N queue, it is illustrated ho...
متن کاملHow Large Delays Build Up in a GI/G/1 Queue
Let W k denote the waiting time of customer k, k >/0, in an initially empty GI/G/1 queue. Fix a > 0. We prove weak limit theorems describing the behaviour of Wk/n, 0 <~ k <~ n, given W~ > na. Let X have the distribution of the difference between the service and interarrival distributions. We consider queues for which Cramer type conditions hold for X, and queues for which X has regularly varyin...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملCommuting matrices in the queue length and sojourn time analysis of MAP/MAP/1 queues
Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and di erent representations for their stationary sojourn time and queue length distribution have been derived. More speci cally, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queue...
متن کامل